منابع مشابه
Provably Secure One-Way Hash Functions
This paper surveys recent progress on the construction of provably secure one-way hash functions, under gradually weakened assumptions. One-way hash functions have many cryptographic applications. In digital signatures, they are used to compress long input strings prior to actual signing procedures. This usually greatly improves the overall efficiency of a signature scheme. They are also used t...
متن کاملOne-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
In this paper, we study connections among one-way functions, hard on the average problems, and statistical zero-knowledge proofs. In particular, we show how these three notions are related and how the third notion can be better characterized, assuming the rst one.
متن کاملEfficient Pseudorandom Generators from Exponentially Hard One-Way Functions
In their seminal paper [HILL99], H̊astad, Impagliazzo, Levin and Luby show that a pseudorandom generator can be constructed from any one-way function. This plausibility result is one of the most fundamental theorems in cryptography and helps shape our understanding of hardness and randomness in the field. Unfortunately, the reduction of [HILL99] is not nearly as efficient nor as security preserv...
متن کاملStatistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions
Concurrent non-malleable zero-knowledge (CNMZK) protocols are zero-knowledge protocols that are secure even against adversaries that interact with multiple provers and verifiers simultaneously. Recently, the first statistical CNMZK argument forNP was constructed under the DDH assumption (Orlandi el al., TCC’14). In this paper, we construct a statistical CNMZK argument forNP assuming only the ex...
متن کاملOne-Way Functions are Essential for Non-Trivial Zero-Knowledge
It was known that if one-way functions exist, then there are zero-knowledge proofs for every language in PSPACE . We prove that unless very weak one-way functions exist, ZeroKnowledge proofs can be given only for languages in BPP. For average-case definitions of BPP we prove an analogue result under the assumption that uniform one-way functions do not exist. ∗ University of California at Berkel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2002
ISSN: 1347-6157,1340-9050
DOI: 10.4036/iis.2002.57